Connectionist variable binding
نویسندگان
چکیده
Variable binding has long been a challenge to connectionists. Attempts to perform variable binding using localist and distributed connectionist representations are discussed, and problems inherent in each type of representation are outlined.
منابع مشابه
A Connectionist Architecture with Inherent Systematicity
For connectionist networks to be adequate for higher level cognitive activities such as natural language interpretation, they have to generalize in a way that is appropriate given the regularities of the domain. Fodor and Pylyshyn (1988) identified an important pattern of regularities in such domains, which they called systematicity. Several attempts have been made to show that connectionist ne...
متن کاملA Connectionist Architecture with Inherent Systematicity0
For connectionistnetworks to be adequate for higher level cognitive activities such as natural language interpretation, they have to generalize in a way that is appropriate given the regularities of the domain. Fodor and Pylyshyn (1988) identified an important pattern of regularities in such domains, which they called systematicity. Several attempts have been made to show that connectionist net...
متن کاملOn Variable Binding in Connectionist Networks
This paper deals with the problem of variable binding in connectionist networks. Speci cally, a more thorough solution to the variable binding problem based on the Discrete Neuron formalism is proposed and a number of issues arising in the solution are examined in relation to logic: consistency checking, binding generation, uni cation, and functions. We analyze what is needed in order to resolv...
متن کاملBeyond associative memories: Logics and variables in connectionist models
This paper demonstrates the role of connectionist (neural network) models in reasoning beyond that of an associative memory. First we show that there is a connection between propositional logics and the weighted-sum computation customarily used in connectionist models. Speci cally, the weighted-sum computation can handle Horn clause logic and Shoham's logic as special cases. Secondly, we show h...
متن کاملTensor Product Variable Binding and the Representation of Symbolic Structures in Connectionist Systems
A general method, the tensor product representation, is defined for the connectionist representation of value~variable bindings. The technique is a formalization of the idea that a set of value~variable pairs can be represented by accumulating activity in a collection of units each of which computes the product of a feature of a variable and a feature of its value. The method allows the fully d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Systems
دوره 16 شماره
صفحات -
تاریخ انتشار 1999